Identification of Corrupted Data via $k$-Means Clustering for Function Approximation
نویسندگان
چکیده
منابع مشابه
Approximation Bound for K-Means clustering of Binary Data
We prove that a p-swap search algorithm for the K-means clustering problem has an approximation bound 3 + 2 p , assuming a binary data set and Euclidean distance. This is tighter than the general bound “ 3 + 2 p ”2 . We also present an example resulting in a cost ratio of 3− . Thus, our bound is almost sharp for the p-swap algorithm.
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملpersistent k-means: stable data clustering algorithm based on k-means algorithm
identifying clusters or clustering is an important aspect of data analysis. it is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. it is a main task of exploratory data mining, and a common technique for statistical data analysis this paper proposed an improved version of k-means algorithm, namely persistent k...
متن کاملCanonical k-Means Clustering for Functional Data
Thaddeus Tarpey and Eva Petkova 1 Department Mathematics and Statistics, Wright State University, Dayton, Ohio 45435, [email protected]. 2 Department of Child and Adolescent Psychiatry, New York University, New York, NY 10016-6023 Abstract Cluster analysis is a powerful tool for discovering sources of heterogeneity in data. However, clinically interesting sources of heterogeneity, such...
متن کاملScalable Kernel k-Means via Centroid Approximation
Although kernel k-means is central for clustering complex data such as images and texts by implicit feature space embedding, its practicality is limited by the quadratic computational complexity. In this paper, we present a novel technique based on scalable centroid approximation that accelerates kernel k-means down to a sub-quadratic complexity. We prove near-optimality of our algorithm, and e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: CSIAM Transactions on Applied Mathematics
سال: 2021
ISSN: 2708-0560,2708-0579
DOI: 10.4208/csiam-am.2020-0212